Polynomial time quantum algorithms for certain bivariate hidden polynomial problems
نویسندگان
چکیده
منابع مشابه
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems
We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input consists of several level set superpositions, a more difficult version of the problem than the one where the input is given by an oracle. For constant degre...
متن کاملPolynomial Time Algorithms for Bichromatic Problems
In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested in extending the algorithms and techniques ...
متن کاملPolynomial-Time Algorithms for Phylogenetic Inference Problems
A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Minimal Episodes Inference, aims at inferring a species tree based on a model of speciation and duplication where duplications are clustered in duplication episodes. The goal is to minimize the number of such episodes. T...
متن کاملPeriodic Constraint Satisfaction Problems: Polynomial-Time Algorithms
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint satisfaction problem. An input instance of the periodic CSP is a finite set of “generating” constraints over a structured variable set that implicitly specifies a larger, possibly infinite set of constraints; the problem is to decide whether or not the larger set of constraints has a satisfying assig...
متن کاملA Polynomial - Time Reduction from Bivariate to Univariate Integral Polynomial
A Abstract n algorithm is presented which reduces the prob-m lem of finding the irreducible factors of a bivariate polyno-ial with integer coefficients in polynomial time in the total i degree and the coefficient lengths to factoring a univariate nteger polynomial. Together with A. Lenstra's, H. Lenstra's u and L. Lovasz' polynomial-time factorization algorithm for nivariate integer polynomials...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2014
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic14.9-10-6